A Radial Estimation-of-Distribution Algorithm for the Job-Shop Scheduling Problem
نویسندگان
چکیده
The job-shop environment has been widely studied under different approaches. It is due to its practical characteristic that makes research interesting. Therefore, the scheduling problem continues being attracted develop new evolutionary algorithms. In this paper, we propose a estimation of distribution algorithm coupled with radial probability function. aforementioned function comes from hydrogen element. This approach proposed in order build competitive for problem. key point exploit construct offspring, and tackle inconvenient EDAs, i.e., lack diversity solutions poor ability exploitation. Various instances numerical experiments are presented illustrate, validate novel research. results, obtained research, permits conclude using distributions an emerging field efficient EDAs.
منابع مشابه
An algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملA fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem
Due to the complicated circumstances in workshop, most of the conventional scheduling algorithms fail to meet the requirements of instantaneity, complexity, and dynamicity in job-shop scheduling problems. Compared with the static algorithms, dynamic scheduling algorithms can better fulfill the requirements in real situations. Considering that both flexibility and fuzzy processing time are commo...
متن کاملAn Algorithm of scheduling for the Job Shop Scheduling Problem
This paper presents an algorithm that applies a new mechanism in order to generate scheduling which allows for evaluation of the quality of solutions that are obtained in the Job Shop Scheduling Problem (JSSP). In this research, the quality of the solution is evaluated by using the makespan as an objective function. It is demonstrated experimentally that the proposed algorithm has better effici...
متن کاملA New Maximum Entropy Estimation of Distribution Algorithm to Solve Uncertain Information Job-shop Scheduling Problem
Estimation of Distribution Algorithm (EDA) is a new kinds of colony evolution algorithm, through counting excellent information of individuals of the present colony EDA construct probability distribution model, then sample the model produces newt generation. To solve the NP-Hard question as EDA searching optimum network structure a new Maximum Entropy Distribution Algorithm (MEEDA) is provided....
متن کاملan algorithm for multi-objective job shop scheduling problem
scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Metaheuristic Computing
سال: 2022
ISSN: ['1947-8291', '1947-8283']
DOI: https://doi.org/10.4018/ijamc.292519